Default Rules: An Extension of Constructive Negation for Narrowing-based Languages
نویسنده
چکیده
In this paper an extension of narrowing-based functional logic languages is proposed: Every partial deenition of a function can be completed with a default rule. In a concrete function call, the default rule is applicable when the normal ones determine that they cannot compute the value of the call. The use of the default rule, in the presence of a goal with variables, is constructive. The operational semantics provides constraints to the variables to make the default rule applicable. Narrowing semantics are modiied extending the technique of constructive negation 3, 4, 17].
منابع مشابه
Extending Constructive Negation for Partial Functions in Lazy Functional-logic Languages
In this paper the mechanism of Default Rules for narrowing-based languages proposed in 24] is adapted to lazy narrowing. Every partial deenition of a function can be completed with a default rule. In a concrete function call, the default rule is applicable when the normal ones determine that they cannot compute the value of the call. Furthermore , when the goal has variables the evaluation mech...
متن کاملSLDNF, Constructive Negation and Grounding
In some approaches to the declarative semantics of logic programming, a program is treated as shorthand for the propositional program Ground(() whose rules are the ground instances of the rules of. We relate the success and failure of a program with a goal G under SLDNF with constructive negation to the success and failure of Ground(() with ground instances of G under propositional SLDNF. As a ...
متن کاملDefault Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe
In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show that default CG rules provide a unifying framework for CG rules as well as polarized CGs (CGs with atomic negation). This framework allows us to study decidable subclasses of a new language mixing CG rules with atomic negation. In th...
متن کاملWell Founded Semantics for Logic Programs with Explicit Negation
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics 22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised 11]. This relationship improves the cross{fertilization between logic programs and default theories, ...
متن کاملA Realistic Architecture for the Semantic Web
In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue that there is a very important class of rule-based languages, with over thirty years of history and experience, which cannot be layered on top of OWL and must be included in the Semantic Web architecture alongside with t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994